Spectral Sparsification of Random-Walk Matrix Polynomials

نویسندگان

  • Dehua Cheng
  • Yu Cheng
  • Yan Liu
  • Richard Peng
  • Shang-Hua Teng
چکیده

We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of a random-walk matrix-polynomial

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification

Motivated by a sampling problem basic to computational statistical inference, we develop a toolset based on spectral sparsification for a family of fundamental problems involving Gaussian sampling, matrix functionals, and reversible Markov chains. Drawing on the connection between Gaussian graphical models and the recent breakthroughs in spectral graph theory, we give the first nearly linear ti...

متن کامل

Tensor sparsification via a bound on the spectral norm of random tensors

Given an order-d tensor A ∈ Rn×n×...×n, we present a simple, element-wise sparsification algorithm that zeroes out all sufficiently small elements of A, keeps all sufficiently large elements of A, and retains some of the remaining elements with probabilities proportional to the square of their magnitudes. We analyze the approximation accuracy of the proposed algorithm using a powerful inequalit...

متن کامل

An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials

We propose a simple, faster and unified algorithm that computes in nearly linear time a spectral sparsifier D − M̂N ≈ε D − D ∑N i=0 γi(D M) of matrix-polynomials, where B = D −M ∈ R is either Laplacian or SDDM matrix with mB non-zero entries, the coefficients γi are induced by a mixture of discrete Binomial distributions (MDBD), and N = 2 k for k ∈ N. Our sparsification algorithm runs in time Õ(...

متن کامل

A spectral method based on the second kind Chebyshev polynomials for solving a class of fractional optimal control problems

In this paper, we consider the second-kind Chebyshev polynomials (SKCPs) for the numerical solution of the fractional optimal control problems (FOCPs). Firstly, an introduction of the fractional calculus and properties of the shifted SKCPs are given and then operational matrix of fractional integration is introduced. Next, these properties are used together with the Legendre-Gauss quadrature fo...

متن کامل

A spectral method based on Hahn polynomials for solving weakly singular fractional order integro-differential equations

In this paper, we consider the discrete Hahn polynomials and investigate their application for numerical solutions of the fractional order integro-differential equations with weakly singular kernel .This paper presented the operational matrix of the fractional integration of Hahn polynomials for the first time. The main advantage of approximating a continuous function by Hahn polynomials is tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1502.03496  شماره 

صفحات  -

تاریخ انتشار 2015